Estimating the control error in discretized PDE-constrained optimization
نویسنده
چکیده
In this article we develop an a posteriori error estimator for discretized optimal control problems. We are interested in estimating the error in the control variable, measured in a natural norm. We prove an error representation formula involving only quantities at hand in a second-order optimization iteration, supposing a strong form of second-order sufficient condition. Possible generalization to the control-constrained case is indicated.
منابع مشابه
Patch Smoothers for Saddle Point Problems with Applications to PDE-Constrained Optimization Problems
We consider a multigrid method for solving the discretized optimality system of a PDE-constrained optimization problem. In particular, we discuss the construction of an additive Schwarz-type smoother for a class of elliptic optimal control problems. A rigorous multigrid convergence analysis yields level-independent convergence rates. Numerical experiments indicate that the convergence rates are...
متن کاملAlgorithms for PDE-Constrained Optimization
In this paper we review a number of algorithmic approaches for solving optimization problems with PDE constraints. Most of these methods were originally developed for finite dimensional problems. When applied to optimization problems with PDE constraints, new aspects become important. For instance, (discretized) PDE-constrained problems are inherently large-scale. Some aspects, like mesh indepe...
متن کامل4 A Multigrid Method for the Solution of Linear-Quadratic Optimal Control Problems
The main part of this chapter is devoted to the development and presentation of a coupled multigrid method for the solution of saddle point systems (2.51) arising from the discretization of PDE constrained optimization problems. In subsequent chapters, the devised method will be adapted to handle inequality constraints on the control, and it will be employed for the solution of the systems, whi...
متن کاملReduced order solution of structured linear systems arising in certain PDE-constrained optimization problems
The solution of PDE-constrained optimal control problems is a computationally challenging task, and it involves the solution of structured algebraic linear systems whose blocks stem from the discretized first-order optimality conditions. In this paper we analyze the numerical solution of this large-scale system: we first perform a natural order reduction, and then we solve the reduced system it...
متن کاملAccelerating PDE constrained optimization by the reduced basis method: application to batch chromatography
In this work, we show that the reduced basis method accelerates a PDE constrained optimization problem, where a nonlinear discretized system with a large number of degrees of freedom must be repeatedly solved during optimization. Such an optimization problem arises, for example, from batch chromatography. Instead of solving the full system of equations, a reduced model with a small number of eq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Num. Math.
دوره 14 شماره
صفحات -
تاریخ انتشار 2006